<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-positivity of dual canonical basis elements from 1324- and 2143-avoiding Kazhdan–Lusztig immanants
نویسندگان
چکیده
In this note, we show that certain dual canonical basis elements of ℂ[SL m ] are positive when evaluated on k-positive matrices, matrices whose minors size k×k and smaller positive. Skandera showed all can be written in terms Kazhdan–Lusztig immanants, which were introduced by Rhoades Skandera. We focus the expressed immanants indexed 1324- 2143-avoiding permutations. This extends previous work authors uses similar tools, namely Lewis Carroll’s identity (also known as Desnanot-Jacobi identity).
منابع مشابه
On permutations which are 1324 and 2143 avoiding
We consider permutations which are 1324 and 2143 avoiding, where 2143 avoiding means that it is 2143 avoiding with the additional Bruhat restriction {2 ↔ 3}. In particular, for every permutation π we will construct a linear map Lπ and a labeled graph Gπ and will show that the following three conditions are equivalent: π is 1324 and 2143 avoiding; Lπ is onto; Gπ is a forest. We will also give so...
متن کاملBitableaux and Zero Sets of Dual Canonical Basis Elements
We state new results concerning the zero sets of polynomials belonging to the dual canonical basis of C[x1,1, . . . , xn,n]. As an application, we show that this basis is related by a unitriangular transition matrix to the simpler bitableau basis popularized by Désarménien-Kung-Rota. It follows that spaces spanned by certain subsets of the dual canonical basis can be characterized in terms of p...
متن کاملCounting 1324-Avoiding Permutations
We consider permutations that avoid the pattern 1324. By studying the generating tree for such permutations, we obtain a recurrence formula for their number. A computer program provides data for the number of 1324-avoiding permutations of length up to 20.
متن کاملCounting 1324, 4231-Avoiding Permutations
Classes of permutations are sets of permutations that are closed downwards under taking subpermutations. They are usually presented as sets C that avoid a given set B of permutations (i.e. the permutations of C have no subpermutation in the set B). We express this by the notation C = Av(B). Much of the inspiration for elucidating the structure of pattern classes has been driven by the enumerati...
متن کاملoutputs Permutations avoiding 1324 and patterns in
The class Av(1324), of permutations avoiding the pattern 1324, is one of the simplest sets of combinatorial objects to define that has, thus far, failed to reveal its enumerative secrets. By considering certain large subsets of the class, which consist of permutations with a particularly regular structure, we prove that the growth rate of the class exceeds 9.81. This improves on a previous lowe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebraic combinatorics
سال: 2023
ISSN: ['2589-5486']
DOI: https://doi.org/10.5802/alco.257